Achieving Robust Average Consensus Over Lossy Wireless Networks
نویسندگان
چکیده
منابع مشابه
Average Consensus in Dense Wireless Networks with Long-Range Connectivity
We consider the effect of interference on the convergence rate of a class of distributed averaging algorithms called consensus algorithms, which iteratively compute the measurement average by message passing among nodes. It is usually assumed that these algorithms converge faster with a greater exchange of information (i.e., by increased network connectivity) in every iteration. However, when t...
متن کاملApplication-oriented multimedia scheduling over lossy wireless networks
This work seeks a better understanding of the relations between the better network service provided by QoSoriented wireless packet scheduling and the actual benefits perceived by the multimedia applications that use them. Through extensive simulations driven by real (multimedia and wireless channel error) traces, we observe that in general, there is a performance gap between application perceiv...
متن کاملAchieving Fairness over 802.11 Multihop Wireless Ad Hoc Networks
IEEE 802.11 MAC protocol for medium access control in wireless Local Area Networks (LANs) is the de facto standard for wireless ad hoc networks. However, it does not perform well in terms of fairness, delay and throughput specially, in multihop networks. The problem is due to both the MAC and link layer contentions. Many research papers have been published in these fields. Among them, a modific...
متن کاملAchieving Spatial Scalability for Coded Caching over Wireless Networks
The coded caching scheme proposed by Maddah-Ali and Niesen considers the delivery of files in a given content library to users through a deterministic error-free network where a common multicast message is sent to all users at a fixed rate, independent of the number of users. In order to apply this paradigm to a wireless network, it is important to make sure that the common multicast rate does ...
متن کاملDistributed robust estimation over randomly switching networks using H∞ consensus
The paper considers a distributed robust estimation problem over a network with Markovian randomly varying topology. The objective is to deal with network variations locally, by switching observer gains at affected nodes only. We propose sufficient conditions which guarantee a suboptimal H∞ level of relative disagreement of estimates in such observer networks. When the status of the network is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2019
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2018.2800407